منابع مشابه
Algorithm forRegular Grammar Inference ?
We present provably correct interactive algorithms for learning regular grammars from positive examples and membership queries. A structurally complete set of strings from a language L(G) corresponding to a target regular grammar G implicitly speciies a lattice of nite state automata (FSA) which contains a FSA MG corresponding to G. The lattice is compactly represented as a version-space and MG...
متن کاملReduction of Enumeration in Grammar Acquisition
c) non-sentences i d e n t i f i e d as such. We note tha t the a v a i l a b i l i t y of s t r uc tu re ( i t em b ) ) d i f f e r e n t i a t e s t h i s model from o ther cu r ren t s tud ies on the a c q u i s i t i o n o f grammar (2) ( 3 ) . The knowledge of s t r u c t u r e , p r i o r to * * Work supported by C o n s i g l i o Nazionale d e l l e R i c e r c h e . The f i r s t pa r t...
متن کاملGrammar-Oriented Enumeration of Binary Trees
In contrast to traditional integer sequences for the representation of binary trees, a kind of character sequence (words) is presented for binary trees based on a grammar GBT and for full binary trees based on a grammar GFBT. The properties of words derived from GBT (GFBT) are discussed in depth, including necessary and suf"cient conditions for a word, pre"x and suf"x of &(GBT) (&(GFBT)) and al...
متن کاملGrammar Inference for Web Documents
Presentational XML documents, such as XHTML or Presentation MathML, use XML tags mainly for formating purposes, while descriptive XML applications, such as a wellstructured movie database, use tags to structure data items in a semantically meaningful way. There is little semantic connection between tags in a presentational XML document and its content, so the tagging is often complex and seemin...
متن کاملGrammar Inference and Statistical Machine Translation
NLP researchers face a dilemma: on one side, it is unarguably accepted that languages have internal structure rather than strings of words. On the other side, they nd it very di cult and expensive to write grammars that have good coverage of language structures. Statistical machine translation tries to cope with this problem by ignoring language structures and using a statistical models to depi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1977
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(77)80005-3